Length and eigenvalue equivalence

نویسندگان

  • C. J. Leininger
  • D. B. McReynolds
  • W. D. Neumann
  • A. W. Reid
چکیده

Let M be a compact Riemannian manifold, and let ∆ = ∆M denote the Laplace– Beltrami operator of M acting on L2(M). The eigenvalue spectrum E (M) consists of the eigenvalues of ∆ listed with their multiplicities. Two manifolds M1 and M2 are said to be isospectral if E (M1) = E (M2). Geometric and topological constraints are forced on isospectral manifolds; for example if the manifolds are hyperbolic (complete with all sectional curvature equal to −1) then they must have the same volume [18], and so for surfaces the same genus. Another invariant of M is the length spectrum L (M) of M; that is the set of all lengths of closed geodesics on M counted with multiplicities. Two manifolds M1 and M2 are said to be iso-length spectral if L (M1) = L (M2). Under the hypothesis of negative sectional curvature the invariants E (M) and L (M) are closely related. For example, it is known that E (M) determines the set of lengths of closed geodesics, and in the case of closed hyperbolic surfaces, the stronger statement that E (M) determines L (M) and vice-versa holds [7, 8]. In this paper we address the issue of how much information is lost by forgetting multiplicities. More precisely, for a compact Riemannian manifold M, define the eigenvalue set (resp. length set and primitive length set) to be the set of eigenvalues of ∆ (resp. set of lengths all closed geodesics and lengths of all primitive closed geodesics) counted without multiplicities. These sets will be denoted E(M), L(M) and Lp(M) respectively. Two manifolds M1 and M2 are said to be eigenvalue equivalent (resp. length equivalent and primitive length equivalent) if E(M1) = E(M2) (resp. L(M1) = L(M2) and Lp(M1) = Lp(M2)). Although length ∗Partially supported by the N. S. F. †Partially supported by a C.M.I. lift-off ‡Partially supported by the N. S. F. §Partially supported by the N. S. F.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Novel Deflation Technique for Solving Quadratic Eigenvalue Problems

In this paper we propose numerical algorithms for solving large-scale quadratic eigenvalue problems for which a set of eigenvalues closest to a fixed target and the associated eigenvectors are of interest. The desired eigenvalues are usually with smallest modulo in the spectrum. The algorithm based on the quadratic Jacobi-Davidson (QJD) algorithm is proposed to find the first smallest eigenvalu...

متن کامل

First Eigenvalue of One-dimensional Diffusion Pro- Cesses

We consider the first Dirichlet eigenvalue of diffusion operators on the half line. A criterion for the equivalence of the first Dirichlet eigenvalue with respect to the maximum domain and that to the minimum domain is presented. We also describle the relationships between the first Dirichlet eigenvalue of transient diffusion operators and the standard Muckenhoupt’s conditions for the dual weig...

متن کامل

A linear eigenvalue algorithm for the nonlinear eigenvalue problem

The Arnoldi method for standard eigenvalue problems possesses several attractive properties making it robust, reliable and efficient for many problems. Our first important result is a characterization of a general nonlinear eigenvalue problem (NEP) as a standard but infinite dimensional eigenvalue problem involving an integration operator denoted B. In this paper we present a new algorithm equi...

متن کامل

An eigenvalue inequality and spectrum localization for complex matrices

Using the notions of the numerical range, Schur complement and unitary equivalence, an eigenvalue inequality is obtained for a general complex matrix, giving rise to a region in the complex plane that contains its spectrum. This region is determined by a curve, generalizing and improving classical eigenvalue bounds obtained by the Hermitian and skew-Hermitian parts, as well as the numerical ran...

متن کامل

Ela an Eigenvalue Inequality and Spectrum Localization for Complex Matrices∗

Using the notions of the numerical range, Schur complement and unitary equivalence, an eigenvalue inequality is obtained for a general complex matrix, giving rise to a region in the complex plane that contains its spectrum. This region is determined by a curve, generalizing and improving classical eigenvalue bounds obtained by the Hermitian and skew-Hermitian parts, as well as the numerical ran...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006